|
__NOTOC__ SCIP (Solving Constraint Integer Programs) is a mixed integer programming solver and a framework for Branch and cut and Branch and price, developed at Zuse Institute Berlin. The design of SCIP is based on the notion of constraints. It supports about 20 constraint types for mixed-integer linear programming, mixed-integer nonlinear programming, mixed-integer all-quadratic programming and Pseudo-Boolean 〔(Pseudo-Boolean challenge 2009 ) Feb 11, 2011.〕 optimization. There are also some global CP constraints available. SCIP is implemented as C callable library. For user plugins, C++ wrapper classes are provided. The solver for the LP relaxations is not a native component of SCIP, an open LP interface is provided instead. Currently supported LP solvers are CLP, CPLEX, Gurobi, MOSEK, QSopt, SoPlex, and Xpress-Optimizer. SCIP can be run on Linux, Mac, Sun, and Windows operating systems. Run as a standalone solver, it is one of the fastest non-commercial solvers for mixed integer programs.〔(Mixed Integer Linear Programming Benchmark ) Mar 18, 2012.〕 SCIP can be accessed through the modeling system of GAMS. Interfaces to MATLAB and AMPL are available within the standard distribution. == References == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「SCIP (optimization software)」の詳細全文を読む スポンサード リンク
|